Rational Streams Coalgebraically
نویسنده
چکیده
We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the equivalence of four notions of representability of rational streams: by finite dimensional linear systems; by finite stream circuits; by finite weighted stream automata; and by finite dimensional subsystems of the set of streams.
منابع مشابه
Stream processing coalgebraically
We study various operations for splitting, partitioning, projecting and merging streams of data. These operations are motivated by their use in dataflow programming and stream processing languages. We use the framework of stream calculus and stream circuits for defining and proving properties of such operations using behavioural differential equations and coinduction proof principles. As a feat...
متن کاملUsing coalgebra and coinduction to define ontology-based multi-agent systems
In the past, algebra has been predominantly used to define computer systems. However, computer systems are becoming more dynamic nowadays and algebra is not suitable anymore to define such systems. For this reason, coalgebra and coinduction have been introduced into the computer and information society. Coalgebra and coinduction present a powerful mechanism for representing many different kinds...
متن کاملBehavioural Differential Equations: a Coinductive Calculus of Streams, Automata, and Power Series Behavioural Diierential Equations: a Coinductive Calculus of Streams, Automata, and Power Series
Streams, (automata and) languages, and formal power series are viewed coalgebraically. In summary , this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being nal. Finality then forms the basis for both deenitions and proofs by coinduction, the coalgebraic counterpart of induction. Coinductive deenitions take the shape of what we hav...
متن کاملCentrum Voor Wiskunde En Informatica Reportrapport Behavioural Differential Equations: a Coinductive Calculus of Streams, Automata, and Power Series Behavioural Diierential Equations: a Coinductive Calculus of Streams, Automata, and Power Series
Streams, automata and languages, and formal power series are viewed coalgebraically. In summary , this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being nal. Finality then forms the basis for both deenitions and proofs by coinduction, the coalgebraic counterpart of induction. Coinductive deenitions take the shape of what we h a v...
متن کاملDefining Context-Free Power Series Coalgebraically
In this paper we present a coinductive definition of context free power series in terms of behavioural differential equations. We show that our coalgebraic approach provides a unified view on many, at first sight different, existing notions of algebraicity, and we apply our behavioural differential equations to produce a new proof for a classical result by Chomsky and Schützenberger, and a simp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logical Methods in Computer Science
دوره 4 شماره
صفحات -
تاریخ انتشار 2008